Self-supervised deep subspace clustering with entropy-norm

نویسندگان

چکیده

Auto-Encoder based Deep Subspace Clustering (DSC) has been widely applied in computer vision, motion segmentation and image processing. However, existing DSC methods suffer from two limitations: (1) they ignore the rich useful relational information connectivity within each subspace due to reconstruction loss; (2) design convolutional networks individually according specific datasets. To address above problems improve performance of DSC, we propose a novel algorithm called Self-Supervised deep with Entropy-norm(S $$^{3}$$ CE) this paper. Firstly, S CE introduces self-supervised contrastive learning pre-train encoder instead requiring decoder. Besides, trained is used as feature extractor segment by combining self-expression layer entropy-norm constraint. This not only preserves local structure data, but also improves between data points. Extensive experimental results demonstrate superior comparison state-of-the-art approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Sparse Subspace Clustering

In this paper, we present a deep extension of Sparse Subspace Clustering, termed Deep Sparse Subspace Clustering (DSSC). Regularized by the unit sphere distribution assumption for the learned deep features, DSSC can infer a new data affinity matrix by simultaneously satisfying the sparsity principle of SSC and the nonlinearity given by neural networks. One of the appealing advantages brought by...

متن کامل

Deep Subspace Clustering Networks

We present a novel deep neural network architecture for unsupervised subspace clustering. This architecture is built upon deep auto-encoders, which non-linearly map the input data into a latent space. Our key idea is to introduce a novel self-expressive layer between the encoder and the decoder to mimic the “selfexpressiveness” property that has proven effective in traditional subspace clusteri...

متن کامل

Deep Subspace Clustering with Sparsity Prior

Subspace clustering aims to cluster unlabeled samples into multiple groups by implicitly seeking a subspace to fit each group. Most of existing methods are based on a shallow linear model, which may fail in handling data with nonlinear structure. In this paper, we propose a novel subspace clustering method – deeP subspAce clusteRing with sparsiTY prior (PARTY) – based on a new deep learning arc...

متن کامل

Feature Selection based Semi-Supervised Subspace Clustering

Clustering is the process which is used to assign a set of n objects into clusters(groups). Dimensionality reduction techniques help in increasing the accuracy of clustering results by removing redundant and irrelevant dimensions. But, in most of the situations, objects can be related in different ways in different subsets of the dimensions. Dimensionality reduction tends to get rid of such rel...

متن کامل

A Self-Training Subspace Clustering

Accurate identification of the cancer types is essential to cancer diagnoses and treatments. Since cancer tissue and normal tissue have different gene expression, gene expression data can be used as an efficient feature source for cancer classification. However, accurate cancer classification directly using original gene expression profiles remains challenging due to the intrinsic high-dimensio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cluster Computing

سال: 2023

ISSN: ['1386-7857', '1573-7543']

DOI: https://doi.org/10.1007/s10586-023-04033-7